A novel scaling scheme for fast Hartley transform
نویسندگان
چکیده
This paper presents some results on fixed-point error analysis of the fast Hartley transform algorithms. A novel scheme for preventing overflow is considered in the analysis. It is proved that error performance, defined based on the signal-to-noise ratio, can be improved for both the decimation-in-frequency and the decimation-in-time fast Hartley transform algorithms. Zusammenfassung . Dieser Artikel stellt einige Ergebnisse zur Festkommafehleranalyse der schnellen Hartley Transformation vor. In der Analyse wird eine neue Methode betrachtet, urn Uberlanf zu verhindem. Es wird bewiesen dab der Fehlereinflug, basierend anf der Definition des Signal zu Rauschverh~iltnisses, sowohl for frequenzdezimierende als auch fOr zeitdezimierende schnelle Algorithmen for die Hartley Transformation vermindert werden kann. R~sum~. Cet article prtsente qnelques rtsultats sur l 'analyse de l'erreur en prtcision finie des algorithmes de transformation de Hartley rapides. Nous considtrons dans cette analyse une mtthode nouvelle de prtvention du dtpassement. Nous prouvons que les performances d'erreur, dtfinies par ie rapport signal snr bruit, peuvent 8tre amtliortes h la fois pour les algorithmes de transformation de Hartley rapides basts sur la dtcimation en frtquence et pour ceux basts sur la dtcimation en temps.
منابع مشابه
Calculating the FHT in hardware
We have developed a parallel, pipelined architecture for calculating the Fast Hartley Transform. Hardware implementation of the FHT introduces two challenges: retrograde indexing and data scaling. We propose a novel addressing scheme that permits the fast computation of FHT butterflies, and describe a hardware implementation of conditional block floating point scaling that reduces error due to ...
متن کاملGENERATION OF MULTIPLE SPECTRUM-COMPATIBLE ARTIFICIAL EARTHQUAKE ACCELEGRAMS WITH HARTLEY TRANSFORM AND RBF NEURAL NETWORK
The Hartley transform, a real-valued alternative to the complex Fourier transform, is presented as an efficient tool for the analysis and simulation of earthquake accelerograms. This paper is introduced a novel method based on discrete Hartley transform (DHT) and radial basis function (RBF) neural network for generation of artificial earthquake accelerograms from specific target spectrums. Acce...
متن کاملA Factorization Scheme for Some Discrete Hartley Transform Matrices
Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis, signal processing, and statistical methods. The successful application of transform techniques relies on the existence of efficient fast transforms. In this paper some fast algorithms are derived. The theoretical lower bound on the multiplicative c...
متن کاملSome New Results in Fast Hartley Transform Algorithms - M.S. Thesis
Finding the spectrum of a signal swiftly has been an ever-growing demand in Digital Signal Processing. In quest to meet this stipulation, Discrete Hartley Transform (DHT) is becoming as an encouraging substitute to the more popular discrete Fourier transform. Fast methods to compute the DHT are in existence and are named as fast Hartley transforms (FHTs). In this thesis, a new split-radix FHT a...
متن کاملTrigonometric Transforms for High-Speed Optical Networks: All-Optical Architectures and Optical OFDM
In this paper, it is shown that the use of real trigonometric transforms can advantageously replace the Fourier transform in optical communication systems, for both all-optical and electronic signal processing. All-optical discrete Hartley transform (DHT) and discrete Cosine transform (DCT) architectures for high-speed optical signal processing, filtering and data compression are given and comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Signal Processing
دوره 34 شماره
صفحات -
تاریخ انتشار 1993